On block minimal residual methods
نویسندگان
چکیده
منابع مشابه
Multilevel Minimal Residual Methods for Nonsymmetric Elliptic Problems
The subject of this paper is to study the performance of multilevel preconditioning for nonsymmetric elliptic boundary value problems. In particular, a minimal residual method with respect to an appropriately scaled norm, measuring the size of the residual projections on all levels, is studied. This norm, induced by the multilevel splitting, is also the basis for a proper stopping criterion. Ou...
متن کاملPreconditioned Galerkin and minimal residual methods for solving Sylvester equations
This paper presents preconditioned Galerkin and minimal residual algorithms for the solution of Sylvester equations AX XB = C. Given two good preconditioner matricesM and N for matrices A and B, respectively, we solve the Sylvester equations MAXN MXBN =MCN. The algorithms use the Arnoldi process to generate orthonormal bases of certain Krylov subspaces and simultaneously reduce the order of Syl...
متن کاملNew conditions for non-stagnation of minimal residual methods
In the solution of large linear systems, a condition guaranteeing that a minimal residual Krylov subspace method makes some progress, i.e., that it does not stagnate, is that the symmetric part of the coefficient matrix be positive definite. This condition results in a well-established worst-case bound for the convergence rate of the iterative method, due to Elman. This bound has been extensive...
متن کاملThe Improved Quasi - Minimal Residual
For the solutions of linear systems of equations with unsymmetric coeecient matrices, we propose an improved version of the quasi-minimal residual (IQMR) method by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design. For Lanczos process, stability is obtained by a coupled two-term procedure that generates Lanczos vectors normali...
متن کاملWeights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2007
ISSN: 0893-9659
DOI: 10.1016/j.aml.2006.04.009